Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
201	The Emergent City. From Complexity to The City of Bits. The artwork captures the changes over time in the environment (city) and represents the changing life and complexity of space as an emergent artwork. The artwork e Add to Reading List Source URL: www.stanza.co.uk Language: English - Date: 2014-09-22 07:26:27 Knowledge Wireless sensor network Complexity Emergence Installation art Science Metaphysics Wireless networking
202	New complexity results for time-constrained dynamical optimal path problems Add to Reading List Source URL: www.emis.ams.org Language: English - Date: 2010-02-01 11:59:55 Operations research Network flow Mathematical optimization Maximum flow problem Shortest path problem Optimal control Flow network Graph Dynamic programming Mathematics Graph theory Theoretical computer science
203	Tight Bounds for Asynchronous Renaming1 DAN ALISTARH, Microsoft Research Cambridge JAMES ASPNES2 , Yale KEREN CENSOR-HILLEL3 , Technion SETH GILBERT4 , National University of Singapore RACHID GUERRAOUI, EPFL Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Analysis of algorithms Algorithm Time complexity Randomized algorithm Adversary model Consensus Distributed computing Complexity Quantum algorithm Theoretical computer science Applied mathematics Computational complexity theory
204	The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Computer science Algorithm Randomized algorithm Time complexity Adversary model Asymptotically optimal algorithm Quantum algorithm Computational complexity theory Theoretical computer science Applied mathematics Analysis of algorithms
205	Scalable Algorithms for Constructing Balanced Spanning Trees on System-ranked Process Groups Akhil Langer, Ramprasad Venkataraman, and Laxmikant Kale Department of Computer Science University of Illinois at Urbana-Champa Add to Reading List Source URL: charm.cs.illinois.edu Language: English - Date: 2012-09-08 17:52:14 Spanning tree Parallel computing Message Passing Interface Search algorithms Hash function Time complexity MPICH Theoretical computer science Concurrent computing Computing
206	Noname manuscript No. (will be inserted by the editor) Faster Randomized Consensus With an Oblivious Adversary James Aspnes Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:34:00 Analysis of algorithms Probabilistic complexity theory Consensus Randomized algorithm Time complexity SL Iterated logarithm Theoretical computer science Computational complexity theory Applied mathematics
207	A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic Razvan Barbulescu1 , Pierrick Gaudry1 , Antoine Joux2,3 , and Emmanuel Thomé1 1 Add to Reading List Source URL: www.loria.fr Language: English - Date: 2013-12-16 04:03:37 Finite fields Group theory Logarithms Cryptography Computational complexity theory Time complexity Polynomial General number field sieve Field extension Abstract algebra Mathematics Algebra
208	Sub-Logarithmic Test-and-Set Against a Weak Adversary? Dan Alistarh1 and James Aspnes2 1 2 Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Consensus Algorithm Time complexity Adversary model Logarithm Theoretical computer science Computational complexity theory Applied mathematics
209	Lower Bounds for Restricted-Use Objects James Aspnes∗ Keren Censor-Hillel† Hagit Attiya‡ Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:34:00 Analysis of algorithms Time complexity Big O notation Theoretical computer science Computational complexity theory Applied mathematics
210	Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs Marc Lelarge1,2 and Hang Zhou1 1 Ecole ´ Add to Reading List Source URL: www.normalesup.org Language: English - Date: 2014-01-18 08:40:12 Analysis of algorithms Time complexity Algorithm Matching Theoretical computer science Computational complexity theory Applied mathematics

UPDATE